The Combinatorics of Reasonable Ultrafilters
نویسنده
چکیده
We are interested in generalizing part of the theory of ultrafilters on ω to larger cardinals. Here we set the scene for further investigations introducing properties of ultrafilters in strong sense dual to being normal. 0. Introduction A lot of knowledge has been accumulated on ultrafilters on ω. In the present paper we are interested in carrying out some of those arguments for ultrafilters on λ > א0, particularly if λ is strongly inaccessible. There is much work on normal ultrafilters, the parallel on ω are Ramsey ultrafilters. Now, every Ramsey ultrafilter on ω is a P -point but there are P -points of very different characters, e.g., P -point with no Ramsey ultrafilter below. Gitik [4] has investigated generalizations of P points for normal ultrafilters. Here we are interested in the dual direction, which up to recently I have not considered to be fruitful. In a long run, we are thinking of generalizing the following: (a) Consistently, some ultrafilters on ω are generated by < 20 many sets. (b) For a function f : ω −→ ω and ultrafilter D on ω, let D/f def = {A ⊆ ω : f(A) ∈ D}; it is an ultrafilter on ω (of course, we are interested in the cases when D and D/f are uniform, which in this case is the same as non-principal). By Blass and Shelah [1], consistently for any two non-principal ultrafilters D1, D2 on ω there are finite-to-one non-decreasing functions f1, f2 : ω −→ ω such that D1/f1 = D2/f2. (c) P -points are preserved by some forcing notions (see, e.g., [10, V], [8]) (d) For a significant family of forcing notions built according to the scheme of creatures of [8] we can consider an appropriate filter, i.e., if 〈pα : α < ω1〉 is ≤-increasing it may define an ultrafilter which is not necessarily generated by א1-sets, so we may ask on this. (e) Consistently, there is no P–point. The weakest demand we consider here for ultrafilters on λ is being weakly reasonable. What is a weakly reasonable ultrafilter on λ? It is a uniform ultrafilter on a regular cardinal λ which does not contain some club of λ and such that this property is preserved if we divide it by a non-decreasing f : λ −→ λ with unbounded range (see Definition 1.4 below). Date: July 2004. 1991 Mathematics Subject Classification. Primary 03E05; Secondary: 03E20. The author acknowledges support from the United States-Israel Binational Science Foundation (Grant no. 2002323). Publication 830. 1
منابع مشابه
Reasonable Ultrafilters, Again
We continue investigations of reasonable ultrafilters on uncount-able cardinals defined in Shelah [8]. We introduce stronger properties of ul-trafilters and we show that those properties may be handled in λ–support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal λ with generating system of siz...
متن کاملUltrafilters, IP sets, Dynamics, and Combinatorial Number Theory
We survey the connection between ultrafilters, ergodic theory, and combinatorics.
متن کامل8 S ep 1 99 3 ULTRAFILTERS : WHERE TOPOLOGICAL DYNAMICS = ALGEBRA = COMBINATORICS
We survey some connections between topological dynamics, semigroups of ultrafilters, and combinatorics. As an application, we give a proof, based on ideas of Bergelson and Hindman, of the Hales-Jewett partition theorem. Furstenberg and his co-workers have shown [15, 16, 17] how to deduce combinatorial consequences from theorems about topological dynamics in compact metric spaces. Bergelson and ...
متن کاملUsing Βs in Combinatorics and Dynamical Systems (survey)
1. Basic properties of ultrafilters 2. Applications of ultrafilters. The space βS 3. Semigroups: basic facts and examples 4. βS as a semigroup 5. Hindman’s finite sums theorem 6. Semigroups: ideals and minimal idempotents 7. The Hales-Jewett theorem 8. Large sets: thick, central, IP-, and syndetic sets 9. Large sets: piecewise syndetic sets 10. Dynamical systems: basic notions 11. βS as a dynam...
متن کاملUltrafilters on G-spaces
For a discrete group G and a discrete G-space X, we identify the Stone-Čech compactifications βG and βX with the sets of all ultrafilters on G and X, and apply the natural action of βG on βX to characterize large, thick, thin, sparse and scattered subsets of X. We use G-invariant partitions and colorings to define G-selective and G-Ramsey ultrafilters on X. We show that, in contrast to the set-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008